Orthogonal latin squares of Sudoku type
نویسنده
چکیده
Orthogonal latin squares of Sudoku type Hans-Dietrich Gronau Universität Rostock, Inst. für Mathematik 18051 Rostock, Germany We present results on the existence of orthogonal latin squares and latin rectangles of Sudoku type.
منابع مشابه
Upper bounds on sets of orthogonal colorings of graphs
We generalize the notion of orthogonal latin squares to colorings of simple graphs. Two n-colorings of a graph are said to be orthogonal if whenever two vertices share a color in one coloring they have distinct colors in the other coloring. We show that the usual bounds on the maximum size of a certain set of orthogonal latin structures such as latin squares, row latin squares, equi-n squares, ...
متن کاملA short note regarding existence of complete sets of orthogonal diagonal Sudoku squares
In an earlier paper, [A.D. Keedwell, Australas J. Combin. 47 (2010), 227–238], we proved that complete sets of orthogonal diagonal Sudoku latin squares exist of all orders p, where p is a prime. We also showed that complete sets of orthogonal Sudoku latin squares which are left semidiagonal exist of all orders p, s > 1, and we conjectured that these may be right semi-diagonal also but we were n...
متن کاملConstructions of complete sets of orthogonal diagonal Sudoku squares
We prove that complete sets of orthogonal diagonal Sudoku latin squares (sometimes called Sudoku frames) exist of all orders p, where p is a prime. We also show that complete sets of orthogonal Sudoku frames which are left semi-diagonal exist of all orders p, s > 1. We conjecture that these may be right semi-diagonal also but we do not have a general proof. We show how these complete sets may b...
متن کاملIterative Decoding for Sudoku and Latin Square Codes
This paper presents a new class of q-ary erasure-correcting codes based on Latin and Sudoku squares of order q, and an iterative decoding algorithm similar to the one used for the Low Density Parity Check code. The algorithm works by assigning binary variables to the q-ary values, and by generalizing the definition of parity check operation to represent the constraints that define the Latin and...
متن کاملEnumerating possible Sudoku grids
In some of these boxes, the setter puts some of the digits 1–9; the aim of the solver is to complete the grid by filling in a digit in every box in such a way that each row, each column, and each 3× 3 box contains each of the digits 1–9 exactly once. In this note, we discuss the problem of enumerating all possible Sudoku grids. This is a very natural problem, but, perhaps surprisingly, it seems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010